On the efficiency of direct powers of PGL(2, p)

نویسندگان

  • C. M. Campbell
  • P. P. Campbell
  • B. T. K. Hopson
  • E. F. Robertson
چکیده

A finite group G is said to be efficient if G has a presentation 〈 X | R 〉 where |R| = |X|+rank(M(G)) where M(G) is the Schur multiplier of G; see for example [14]. The efficiency of direct powers, G, of a finite group G has been studied over a number of years, see for example [5], [8] and [14]. In [6] the problem of proving that G is efficient for all n ∈ N, in the case of an imperfect group, is shown to reduce to proving that G is efficient for a finite number of values of n. Recently there has been interest in the semigroup efficiency of groups, see [2]. In particular the semigroup efficiency of direct powers of groups is considered in [1]. The purpose of this paper is to prove that G(p) is efficient for all odd primes p and all n ∈ N, where G(p) is given by the presentation

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The relationship between maximum oxygen consumption with strength and endurance of hand grip powers in assembly workers

Introduction: Grip and pinch strength assess the function of hand and is considered as a sign of general health. Considering the high prevalence of related-work musculoskeletal disorders (WMSDs) due to the incongruity of work with the workers and preventability of diseases that are caused by such incongruity, we decided to study the relationship between maximum oxygen consumption (Vo2max) and w...

متن کامل

On some Frobenius groups with the same prime graph as the almost simple group ${ {bf PGL(2,49)}}$

The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...

متن کامل

Recognition by prime graph of the almost simple group PGL(2, 25)

Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...

متن کامل

Active Filter Control Method Based on Direct Power Control for Compensating Reactive Powers due to Unbalanced Voltages and Nonlinear Loads

Active filters have proven to be more effective than passive techniques to improve power quality and to solve harmonic and power factor problems due to nonlinear loads. This paper proposes a control scheme based on the instantaneous active and reactive power. The inverter of this active filter is a three-phase, two-level converter. Space vector technique is used as modulators and pattern genera...

متن کامل

Power Swings Damping Improvement with STATCOM and SMES Based on the Direct Lyapunov Method

In this paper a comprehensive approach is presented to improve power swings damping based on direct Lyapunov method. The approach combines superconducting magnetic energy storage (SMES) system with static synchronous compensator (STATCOM). Considering the energy absorption/injection ability of SMES, in transient states the combination exchanges both active and reactive powers with power system....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003